The Classification of Convex Orders on Affine Root Systems
نویسنده
چکیده
We classify all total orders having a certain convexity property on the positive root system of an arbitrary untwisted affine Lie algebra g. Such total orders are called convex orders and were used to construct Poincaré-BirkhoffWitt type bases of the upper triangular subalgebra of the quantized enveloping algebra of g which are called convex bases.
منابع مشابه
Parametrizations of Infinite Biconvex Sets in Affine Root Systems
We investigate in detail relationships between the set B of all infinite “biconvex” sets in the positive root system ∆+ of an arbitrary untwisted affine Lie algebra g and the set W of all infinite “reduced word” of the Weyl group of g. The study is applied to the classification of “convex orders” on ∆+ (cf. [Ito]), which are indispensable to construct “convex bases” of PoincaréBirkhoff-Witt typ...
متن کاملParameterizations of Infinite Biconvex Sets in Affine Root Systems
We investigate detailed relationships between the set W of all infinite “reduced” sequences of elements of a canonical generating set of an arbitrary affine Weyl group and the set B of all infinite sets having a certain “biconvex” property in a positive root system ∆+ of the corresponding untwisted affine Lie algebra g. The study is related to the classification of convex orders on ∆+, which ar...
متن کاملC*-Extreme Points and C*-Faces oF the Epigraph iF C*-Affine Maps in *-Rings
Abstract. In this paper, we define the notion of C*-affine maps in the unital *-rings and we investigate the C*-extreme points of the graph and epigraph of such maps. We show that for a C*-convex map f on a unital *-ring R satisfying the positive square root axiom with an additional condition, the graph of f is a C*-face of the epigraph of f. Moreover, we prove som...
متن کاملOn the quadratic support of strongly convex functions
In this paper, we first introduce the notion of $c$-affine functions for $c> 0$. Then we deal with some properties of strongly convex functions in real inner product spaces by using a quadratic support function at each point which is $c$-affine. Moreover, a Hyers–-Ulam stability result for strongly convex functions is shown.
متن کاملFace Recognition using an Affine Sparse Coding approach
Sparse coding is an unsupervised method which learns a set of over-complete bases to represent data such as image and video. Sparse coding has increasing attraction for image classification applications in recent years. But in the cases where we have some similar images from different classes, such as face recognition applications, different images may be classified into the same class, and hen...
متن کامل